Maltsev on Top
نویسنده
چکیده
Let A be an idempotent algebra, α ∈ ConA such that A/α has few subpowers, and m be a fixed natural number. There is a polynomial time algorithm that can transform any constraint satisfaction problem over A with relations of arity at most m into an equivalent problem which is m consistent and in which each domain is inside an α block. Consequently if the induced algebras on the blocks of α generate an SD(∧) variety, then CSP(A) is tractable.
منابع مشابه
On Maltsev Digraphs
We study digraphs preserved by a Maltsev operation: Maltsev digraphs. We show that these digraphs retract either onto a directed path or to the disjoint union of directed cycles, showing in this way that the constraint satisfaction problem for Maltsev digraphs is in logspace, L. We then generalize results from Kazda (2011) to show that a Maltsev digraph is preserved not only by a majority opera...
متن کاملMaltsev Families of Varieties Closed under Join or Maltsev Product
Maltsev families of varieties which are closed under join or Maltsev product are investigated. New Maltsev conditions for congruence semi-distributivity are given.
متن کاملA new algorithm for constraint satisfaction problems with Maltsev templates
In this article, we provide a new algorithm for solving constraint satisfaction problems with Maltsev constraints, based on the new notion of Maltsev consistency.
متن کاملDeciding some Maltsev conditions in finite idempotent algebras
In this paper we investigate the computational complexity of deciding if a given finite algebraic structure satisfies a certain type of existential condition on its set of term operations. These conditions, known as Maltsev conditions, have played a central role in the classification, study, and applications of general algebraic structures. Several well studied properties of equationally define...
متن کاملOn Maltsev Conditions associated with omitting certain types of local structures
Tame congruence theory identifies six Maltsev conditions associated with locally finite varieties omitting certain subsets of types of local behaviour. Extending a result of Siggers, we show that of these six Maltsev conditions only two of them are equivalent to strong Maltsev conditions for locally finite varieties. Besides omitting the unary type [18], the only other of these conditions that ...
متن کامل